Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Games- Chan algorithm")

Results 1 to 3 of 3

  • Page / 1
Export

Selection :

  • and

Reducing the computation of linear complexities of periodic sequences over GF(pm)HAO CHEN.IEEE transactions on information theory. 2006, Vol 52, Num 12, pp 5537-5539, issn 0018-9448, 3 p.Article

An algorithm for the k-error linear complexity of sequences over GF(pm) with period pn, p a primeKAIDA, T; UEHARA, S; IMAMURA, K et al.Information and computation (Print). 1999, Vol 151, Num 1-2, pp 134-147, issn 0890-5401Article

Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequencesMEIDL, Wilfried.Theoretical computer science. 2003, Vol 290, Num 3, pp 2045-2051, issn 0304-3975, 7 p.Article

  • Page / 1